/*
Basic Calculator Total Accepted: 7158 Total Submissions: 43583 My Submissions Question Solution
Implement Stack using Queues Total Accepted: 9952 Total Submissions: 32921 My Submissions Question Solution
Implement the following operations of a stack using queues.

push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
empty() -- Return whether the stack is empty.
Notes:
You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid.
Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).
Update (2015-06-11):
The class name of the Java function had been updated to MyStack instead of Stack.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and all test cases.

*/

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <fstream>
#include <sstream>
#include <unordered_set>
#include <unordered_map>
#include "print.h"
using namespace std;

/**
* Definition for binary tree*/


void testForStack()
{
	stack<int> mystack;
	mystack.push(10);
	mystack.push(20);
	mystack.top() -= 5;
	cout << "mystack.top() is now " << mystack.top() << endl;
}

void testForIntToString()
{
	int a = 10;
	stringstream ss;
	ss << a;
	string str = ss.str();
	cout << str << endl;

	string str1 = to_string(a);

}


/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Stack {
public:
	queue<int> queInt;
	// Push element x onto stack.
	void push(int x) {
		queInt.push(x);
	}

	// Removes the element on top of the stack.
	void pop() {
		queue<int> queTemp;
		int temp;
		
		while (!queInt.empty())
		{
			temp = queInt.front();
			queInt.pop();
			if (queInt.empty())
			{
				break;
			}

			queTemp.push(temp);
			
		}
		queInt = queTemp;
		
	}

	// Get the top element.
	int top() {
		queue<int> queTemp;
		int temp = queInt.front();
		queTemp.push(temp);
		queInt.pop();
		while (!queInt.empty())
		{
			temp = queInt.front();
			queTemp.push(temp);
			queInt.pop();
		}
		queInt = queTemp;
		return temp;

	}

	// Return whether the stack is empty.
	bool empty() {
		return queInt.empty();
	}

};



/**
* Your BSTIterator will be called like this:
* BSTIterator i = BSTIterator(root);
* while (i.hasNext()) cout << i.next();
*/

int main(int argc, char* argv[])
{
	int A = 0, B = 0, C = 0, D = 0, E = -1, F = -1, G = 1, H = 1;

	string str = "1-11";

	Solution s;
	int result;

	result = s.calculate(str);

	//int n = 7;
	//ifs1.countPrimes(val);

	//strRes = s.findRepeatedDnaSequences(s1);
	//cout << "The result is : " << result << endl;
	//result = s.partition(str);
	//stackTree.push(p->left);
	//stackTree.push(p->right);
	//if (s1.containsNearbyAlmostDuplicate(vecInt, 1, 2))
	//	cout << " True" << endl;
	//else
	//cout << "false" << endl;
	system("pause");
	return 0;
}
//std::unordered_set<std::string> myset =
//{ "hot", "dot", "dog", "lot", "log" };

//std::cout << "myset contains:";
// for (auto it = myset.begin(); it != myset.end(); ++it)
//std::cout << " " << *it;
//;; std::cout << std::endl;

//TreeNode *root = new TreeNode(1);
//TreeNode *left = new TreeNode(2);
//TreeNode *right = new TreeNode(3);

//root->left = left;
//root->right = right;s
/*
//string s1 = "GAGAGAGAGAGA";
string s1 = "GAGAGAGAGAGA";
vector<string> strRes;

TreeNode *root = new TreeNode(1);
TreeNode *left1 = new TreeNode(2);
TreeNode *left2 = new TreeNode(5);

TreeNode *right1 = new TreeNode(3);
TreeNode *right2 = new TreeNode(4);

root->left = left1;
left1->right = left2;

root->right = right1;
right1->right = right2;

//vector<char> level1({ '1', '1', '1', '1', '0' });
//vector<char> level2({ '1', '1', '0', '1', '0' });
//vector<char> level3({ '1', '1', '0', '0', '0' });
//vector<char> level4({ '0', '0', '0', '0', '0' });


vector<vector<char>> grid;
grid.push_back(level1);
grid.push_back(level2);
grid.push_back(level3);
grid.push_back(level4);ss
ListNode *head = new ListNode(1);
ListNode *head1 = new ListNode(2);
ListNode *head2 = new ListNode(6);
ListNode *head3 = new ListNode(3);
ListNode *head4 = new ListNode(4);
ListNode *head5 = new ListNode(5);

ListNode *head6 = new ListNode(6);

head->next = head1;
head1->next = head2;
head2->next = head3;
head3->next = head4;
head4->next = head5;
head5->next = head6;
int val = 6;
char a1[] = { '1', '0', '1', '0', '0' };
char a2[] = { '1', '0', '1', '1', '0' };
char a3[] = { '1', '1', '1', '1', '1' };
char a4[] = { '1', '0', '0', '1', '0' };

vector<char> level1(a1, a1 + sizeof(a1) / sizeof(char));
vector<char> level2(a1, a1 + sizeof(a1) / sizeof(char));
vector<char> level3(a1, a1 + sizeof(a1) / sizeof(char));
vector<char> level4(a1, a1 + sizeof(a1) / sizeof(char));

vector<vector<char> > martix;
martix.push_back(level1);
martix.push_back(level2);
martix.push_back(level3);
martix.push_back(level4);

Solution s;
int result;
result = s.maximalSquare(martix);
*/
